Fast Arithmetic In Jacobian Of Hyperelliptic Curves Of Genus 2 Over GF(p)
نویسندگان
چکیده
In this paper, we suggest a new fast transformation for a divisor addition for hyperelliptic curves. The transformation targets the Jacobian of genus-2 curves over odd characteristic fields in projective representation. Compared to previously published results, the modification reduces the computational complexity and makes hyperelliptic curves more attractive for applications.
منابع مشابه
Classification of genus 2 curves over F2n and optimization of their arithmetic
To obtain efficient cryptosystems based on hyperelliptic curves, we studied genus 2 isomorphism classes of hyperelliptic curves in characteristic 2. We found general and optimal form for these curves, just as the short Weierstrass form for elliptic curves. We studied the security and the arithmetic on their jacobian. We also rewrote and optimized the formulas of Lange in characteristic 2, and w...
متن کاملFast explicit formulae for genus 2 hyperelliptic curves using projective coordinates (Updated)
This contribution proposes a modification of method of divisors group operation in the Jacobian of hyperelliptic curve over even and odd characteristic fields in projective coordinate. The hyperelliptic curve cryptosystem (HECC), enhances cryptographic security efficiency in e.g. information and telecommunications systems (ITS). Index Terms – hyperelliptic curves, explicit formulae.
متن کاملSpeeding up the Arithmetic on Koblitz Curves of Genus Two
Koblitz, Solinas, and others investigated a family of elliptic curves which admit especially fast elliptic scalar multiplication. They considered elliptic curves deened over the nite eld F 2 with base eld F 2 n. In this paper, we generalize their ideas to hyperelliptic curves of genus 2. Given the two hyperelliptic curves C a : v 2 +uv = u 5 + a u 2 + 1 with a = 0; 1, we show how to speed up th...
متن کاملFast Endomorphism for any Genus 2 Hyperelliptic Curve over a Finite Field of Even Characteristic
In EUROCRYPT 2009, Galbraith, Lin and Scott constructed an efficiently computable endomorphism for a large family of elliptic curves defined over finite fields of large characteristic. They demonstrated that the endomorphism can be used to accelerate scalar multiplication in the elliptic curve cryptosystem based on these curves. In this paper we extend the method to any genus 2 hyperelliptic cu...
متن کاملFast Jacobian Group Arithmetic on CabCurves
The goal of this paper is to describe a practical and eecient algorithm for computing in the Jacobian of a large class of algebraic curves over a nite eld. For elliptic and hyperelliptic curves, there exists an algorithm for performing Jaco-bian group arithmetic in O(g 2) operations in the base eld, where g is the genus of a curve. The main problem in this paper is whether there exists a method...
متن کامل